k1=[]
for t in range(int(input())):
k=[]
n=int(input())
a=list(map(int,input().split()))
for i in range(len(a)+1):
for j in range(i):
k.append(a[j:i])
y=0
for j in k:
y=y+(len(j)+j.count(0))
k1.append(y)
for t1 in k1:
print(t1)#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n; cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++) cin>>v[i];
int ans=0;
for(int i=0;i<n;i++) {
int prev=0;
for(int j=i;j<n;j++) {
prev++;
if(v[j]==0) prev++;
ans+=prev;
}
}
cout<<ans;
}
int32_t main() {
int t; cin>>t;
while(t--) {
solve();
cout<<endl;
}
return 0;
}987A - Infinity Gauntlet | 1676G - White-Black Balanced Subtrees |
1716D - Chip Move | 1352F - Binary String Reconstruction |
1487B - Cat Cycle | 1679C - Rooks Defenders |
56A - Bar | 1694B - Paranoid String |
35A - Shell Game | 1684A - Digit Minimization |
43B - Letter | 1017A - The Rank |
1698B - Rising Sand | 235A - LCM Challenge |
1075B - Taxi drivers and Lyft | 1562A - The Miracle and the Sleeper |
1216A - Prefixes | 1490C - Sum of Cubes |
868A - Bark to Unlock | 873B - Balanced Substring |
1401D - Maximum Distributed Tree | 1716C - Robot in a Hallway |
1688B - Patchouli's Magical Talisman | 99A - Help Far Away Kingdom |
622B - The Time | 1688C - Manipulating History |
1169D - Good Triple | 1675B - Make It Increasing |
588A - Duff and Meat | 1541B - Pleasant Pairs |